FastForest: Increasing random forest processing speed while maintaining accuracy
نویسندگان
چکیده
Abstract Random Forest remains one of Data Mining’s most enduring ensemble algorithms, achieving well-documented levels accuracy and processing speed, as well regularly appearing in new research. However, with data mining now reaching the domain hardware-constrained devices such smartphones Internet Things (IoT) devices, there is continued need for further research into algorithm efficiency to deliver greater speed without sacrificing accuracy. Our proposed FastForest achieves this result through a combination three optimising components - Subsample Aggregating (‘Subbagging’), Logarithmic Split-Point Sampling Dynamic Restricted Subspacing. Empirical testing shows delivers an average 24% increase model-training compared whilst maintaining (and frequently exceeding) classification over tests involving 45 datasets on both PC smartphone platforms. Further show favourable results against number classifiers including implementations Bagging Subspace. With growing interest machine-learning mobile provides efficient classifier that can achieve faster smartphones.
منابع مشابه
Increasing Accuracy While Maintaining Minimal Grammars in Cky Parsing
Significant work in both lexicalized and unlexicalized parsing has been done in the past ten years. F1 measures of accuracy of over 90% have been achieved (Bikel, 2005), and linguistic notions of lexical dependencies and using head words have been harnessed to create significant improvements in probabilistic CFG note, however, that many of the techniques for improving lexicalized parsing create...
متن کاملInfluence of Hyperparameters on Random Forest Accuracy
In this paper we present our work on the Random Forest (RF) family of classification methods. Our goal is to go one step further in the understanding of RF mechanisms by studying the parametrization of the reference algorithm Forest-RI. In this algorithm, a randomization principle is used during the tree induction process, that randomly selects K features at each node, among which the best spli...
متن کاملIncreasing the Decoding Speed of Random Codes Based on Quasigroups
Error-correcting codes based on quasigroup transformations are defined elsewhere. The speed of the decoding process is one of the biggest problems for these codes. In order to improve the decoding speed, we have defined a new algorithm of decoding. Now, we use two transformations of the redundant message by using different parameters, and the candidates for the decoded messages are obtained by ...
متن کاملPreferring Properly: Increasing Coverage while Maintaining Quality in Anytime Temporal Planning
Temporal Fast Downward (TFD) is a successful temporal planning system that is capable of dealing with numerical values. Rather than decoupling action selection from scheduling, it searches directly in the space of time-stamped states, an approach that has shown to produce plans of high quality at the price of coverage. To increase coverage, TFD incorporates deferred evaluation and preferred ope...
متن کاملIncreasing the speed of medical image processing in MatLab®
MatLab(®) has often been considered an excellent environment for fast algorithm development but is generally perceived as slow and hence not fit for routine medical image processing, where large data sets are now available e.g., high-resolution CT image sets with typically hundreds of 512x512 slices. Yet, with proper programming practices - vectorization, pre-allocation and specialization - app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: ['0020-0255', '1872-6291']
DOI: https://doi.org/10.1016/j.ins.2020.12.067